Performance analysis of turbo codes in quasi-static fading channels
نویسندگان
چکیده
The performance of turbo codes in quasi-static fading channels both with and without antenna diversity is investigated. In particular, simple analytic techniques that relate the frame error rate of a turbo code to both its average distance spectrum as well as the iterative decoder convergence characteristics are developed. Both by analysis and simulation, the impact of the constituent recursive systematic convolutional (RSC) codes, the interleaver size and the number of decoding iterations on the performance of turbo codes are also investigated. In particular, it is shown that in systems with limited antenna diversity different constituent RSC codes or interleaver sizes do not affect the performance of turbo codes. In contrast, in systems with significant antenna diversity, particular constituent RSC codes and interleaver sizes have the potential to significantly enhance the performance of turbo codes. These results are attributed to the fact that in single transmit–single receive antenna systems, the performance primarily depends on the decoder convergence characteristics for Eb/N0 values of practical interest. However, in multiple transmit–multiple receive antenna systems, the performance depends on the code characteristics. Index Terms – Performance, Turbo Codes, Quasi-Static Fading Channels, Antenna Diversity
منابع مشابه
New Bounding Techniques for Channel Codes over Quasi - Static Fading Channels
New Bounding Techniques for Channel Codes over Quasi-static Fading Channels. (August 2003) Jingyu Hu, B.E., Shanghai Jiao Tong University, P.R.China Chair of Advisory Committee: Dr. Scott L. Miller This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the...
متن کاملPerformance Analysis and Constituent Code Design for Space-Time Turbo Coded Modulation over Fading Channels
Recent advances in space-time coding and array processing have lead to substantial improvements in broadband wireless access systems. A design method for constituent recursive space-time trellis codes (Rec-STTrCs) and parallel concatenated space-time turbo coded modulation (STTuCM) was introduced recently as a new framework for building low complexity, large equivalent constraint-length STTrCs....
متن کاملFull rate space-time turbo codes
This paper proposes a class of full space diversity full rate space-time turbo codes. Both parallel concatenated and serially concatenated codes are designed. The full space diversity design is facilitated by a rank theory. Compared with space-time trellis codes, the simulations show the space-time turbo codes have excellent performance in both quasi-static fading channels and time varying fadi...
متن کاملPerformance and Design of Turbo Codes on Rayleigh Fading Channels
Fading in wireless environments is a major obstacle to reliable communications. In order to mitigate the e ects of fading, channel coding is often employed. In this thesis, the performance and design of the channel coding technique, turbo codes, [1] is examined over Rayleigh fading channels. The thesis considers coherent BPSK signaling over both time-correlated and fully-interleaved Rayleigh, s...
متن کاملA Rank Criterion for Qam Space-time Codes with Application to Turbo Coding
SufJicient conditions to ensure QAM space-time codes achieve full space diversity in quasi-static fading channel are presented. The conditions are on code words or generator matrices instead of on every code word pair. This simpl@es the check of full space diversity of a code. Based on these conditions, full space diversity parallel concatenated turbo codes are proposed to use in a multiple ele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IET Communications
دوره 2 شماره
صفحات -
تاریخ انتشار 2008